Linear equation solvers

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linear Equation Solvers

In one type the 6,are fed into the machine in such a way as to drive the unknowns Xj to their correct values. In the second type, the xf are not driven by power supplied from the constant inputs but reach an equilibrium situation corresponding to the solution by a process of adjustment. We are concerned in this article with the operating conditions for this last type of machine when the adjusti...

متن کامل

Fast Banded Linear Equation Solvers

A new algorithm for solving triangular linear equations is reported that is signiicantly faster than conventional methods on vector and parallel architectures for small bandwidths. In essence, it is a block version of the cyclic reduction algorithm used for tridiagonal systems of equations, and is applicable to general banded systems as well.

متن کامل

Evaluation of the linear matrix equation solvers in SLICOT

We discuss solvers for Sylvester, Lyapunov, and Stein equations that are available in the SLICOT Library (Subroutine Library In COntrol Theory). These solvers offer improved efficiency, reliability, and functionality compared to corresponding solvers in other computer-aided control system design packages. The performance of the SLICOT solvers is compared with the corresponding MATLAB solvers. T...

متن کامل

A control theory approach to linear equation solvers

We present a new iterative approach for solving linear systems of equations. Our method is inspired by feedback stabilization schemes from robust control and yields a control system, whose parameters can be tuned to achieve prescribed convergence properties. In contrast to well–known iterative solution methods for linear equations from linear algebra, such as GMRES(m) or Arnoldi’s method, the p...

متن کامل

Probabilistic Interpretation of Linear Solvers

This paper proposes a probabilistic framework for algorithms that iteratively solve unconstrained linear problems Bx = b with positive definite B for x. The goal is to replace the point estimates returned by existing methods with a Gaussian posterior belief over the elements of the inverse of B, which can be used to estimate errors. Recent probabilistic interpretations of the secant family of q...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Quarterly of Applied Mathematics

سال: 1949

ISSN: 0033-569X,1552-4485

DOI: 10.1090/qam/31329